Penalized Orthogonal Iteration for Sparse Estimation of Generalized Eigenvalue Problem
نویسندگان
چکیده
منابع مشابه
A New Inexact Inverse Subspace Iteration for Generalized Eigenvalue Problems
In this paper, we represent an inexact inverse subspace iteration method for computing a few eigenpairs of the generalized eigenvalue problem Ax = Bx [Q. Ye and P. Zhang, Inexact inverse subspace iteration for generalized eigenvalue problems, Linear Algebra and its Application, 434 (2011) 1697-1715 ]. In particular, the linear convergence property of the inverse subspace iteration is preserved.
متن کاملA generalized eigenvalue problem for quasi-orthogonal rational functions
In general, the zeros of an orthogonal rational function (ORF) on a subset of the real line, with poles among {α1, . . . , αn} ⊂ (C0 ∪ {∞}), are not all real (unless αn is real), and hence, they are not suitable to construct a rational Gaussian quadrature rule (RGQ). For this reason, the zeros of a so-called quasi-ORF or a so-called paraORF are used instead. These zeros depend on one single par...
متن کاملa new inexact inverse subspace iteration for generalized eigenvalue problems
in this paper, we represent an inexact inverse subspace iteration method for com- puting a few eigenpairs of the generalized eigenvalue problem ax = bx[q. ye and p. zhang, inexact inverse subspace iteration for generalized eigenvalue problems, linear algebra and its application, 434 (2011) 1697-1715 ]. in particular, the linear convergence property of the inverse subspace iteration is preserved.
متن کاملA Decomposition Algorithm for Sparse Generalized Eigenvalue Problem
Sparse generalized eigenvalue problem arises in a number of standard and modern statistical learning models, including sparse principal component analysis, sparse Fisher discriminant analysis and sparse canonical correlation analysis. However, this problem is difficult to solve since it is NP-hard. In this paper, we consider a new decomposition method to tackle this problem. Specifically, we us...
متن کاملA D.C. Programming Approach to the Sparse Generalized Eigenvalue Problem
In this paper, we consider the sparse eigenvalue problem wherein the goal is to obtain a sparse solution to the generalized eigenvalue problem. We achieve this by constraining the cardinality of the solution to the generalized eigenvalue problem and obtain sparse principal component analysis (PCA), sparse canonical correlation analysis (CCA) and sparse Fisher discriminant analysis (FDA) as spec...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Computational and Graphical Statistics
سال: 2019
ISSN: 1061-8600,1537-2715
DOI: 10.1080/10618600.2019.1568014